//package com.mybase.core;
//
//import java.util.ArrayList;
//import java.util.HashMap;
//import java.util.HashSet;
//
//public class MyHashMap<K, V> extends HashMap<K, V> {
//	private static final long serialVersionUID = -8801962734639017349L;
//
//	/**
//	 * Prints all the contents of this <tt>ArrayList</tt> instance. An
//	 * application can use this operation to view all the contents of this
//	 * <tt>ArrayList</tt> instance at any moment.
//	 */
//	public void printAll() {
////		for (Object o : super.toArray()) {
////			System.out.println(o.toString());
////		}
//	}
//
//	/**
//	 * Gets all the entries of this <tt>ArrayList</tt> instance. An application
//	 * can use this operation to get all the contents of this <tt>ArrayList</tt>
//	 * instance at any moment.
//	 * @param <E>
//	 */
//	@SuppressWarnings("unchecked")
//	public <E> ArrayList<E> getKeys() {
//		return null;
////		ArrayList<E> l = new ArrayList<E>();
////		for (Object o : super.toArray()) {
////			l.add((E) o);
////		}
////		return l;
//	}
//
//	/**
//	 * Removes the duplicate entries from this <tt>ArrayList</tt> instance, but
//	 * the order is not maintained. An application can use this operation to
//	 * eliminate the duplicate entries from this <tt>ArrayList</tt> instance,
//	 * without maintaining the order.
//	 */
//	public void removeDuplicates() {
//		HashSet<E> set = new HashSet<E>(this.getAll());
//		this.clear();
//		this.addAll(set);
//	}
//
//	/**
//	 * Removes the duplicate entries from this <tt>ArrayList</tt> instance by
//	 * maintaining the order. An application can use this operation to eliminate
//	 * the duplicate entries from this <tt>ArrayList</tt> instance with the
//	 * order maintained.
//	 */
//	public void eliminateDuplicates() {
//		ArrayList<E> list1 = this.getAll();
//		MyHashMap<E> list2 = new MyHashMap<E>();
//		for (E o : list1) {
//			if (!list2.contains(o)) {
//				list2.add(o);
//			}
//		}
//		this.clear();
//		this.addAll(list2);
//	}
//}